Approximating the 2-machine flow shop problem with exact delays taking two values
نویسندگان
چکیده
منابع مشابه
Approximating the 2-Machine Flow Shop Problem with Exact Delays Taking Two Values
In the 2-Machine Flow Shop problem with exact delays the operations of each job are separated by a given time lag (delay). Leung et al. (2007) established that the problem is strongly NP-hard when the delays may have at most two different values. We present further results for this case: we prove that the existence of (1.25− ε)-approximation implies P=NP and present a 2-approximation algorithm.
متن کاملApproximating Two-Machine Flow Shop Problem with Delays When Processing Times Depend Only on Machines
We study the two-machine flow shop problem with (minimum) delays.The current best approximation factor achieved for this problem is 11/6 ≈ 1.833 (due to Karuno and Nagamochi; their algorithm runs in time O(n log n)). Our main result is a 1.628-approximation algorithm for the case when processing times depend only on machines. This case is strongly NP-hard even when all processing times are equa...
متن کاملThe two - machine flow shop problem with delays and the one - machine total tardiness problem
A partial order on a job set is called consistent, if it has a linear extension which is an optimal solution to the total tardiness problem of the job set. The concept of proper augmentations of consistent partial orders is based on Emmons' well-known dominance theorem. In this paper, we address the question whether the proper augmentation of a consistent partial order always results in a parti...
متن کاملInverse scheduling: two-machine flow-shop problem
We study an inverse counterpart of the two machine flow-shop scheduling problem that arises in the context of inverse optimization. While in the forward scheduling problem all parameters are given and the objective is to find job sequence(s) for which the value of the makespan is minimum, in the inverse scheduling the exact values of processing times are unknown and they should be selected with...
متن کاملInvestigation of the two-machine flow shop scheduling problem to minimize total energy costs with time-dependent energy prices
In this paper, the problem of two-machine flow shop scheduling to minimize total energy costs under time-of-use tariffs is investigated. As the objective function of this study is not a regular measure, allowing intentional idle-time can be advantageous. So this study considers two approaches, one for non-delay version of the problem and the other one for a situation when inserting intentional ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2019
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-019-00775-0